Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
نویسندگان
چکیده
We present a general method for proving DP-hardness of equivalencechecking problems on one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter automata. In this way we show that the membership problem for any relation subsuming bisimilarity and subsumed by simulation preorder is DP-hard (even) for one-counter nets (where the counter cannot be tested for zero). We also show DPhardness for deciding simulation between one-counter automata and finite-state systems (in both directions).
منابع مشابه
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simu...
متن کاملBeyond Language Equivalence on Visibly Pushdown Automata
We study (bi)simulation-like preorder/equivalence checking on visibly pushdown automata, visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulat...
متن کاملDP lower bounds for equivalence-checking and model-checking of one-counter automata
We present a general method for proving DP-hardness of problems related to formal verification of one-counter automata. For this we show a reduction of the SAT–UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter aut...
متن کاملOn Simulation-Checking with Sequential Systems
We present new complexity results for simulation-checking and modelchecking with infinite-state systems generated by pushdown automata and their proper subclasses of one-counter automata and one-counter nets (one-counter nets are ‘weak’ one-counter automata computationally equivalent to Petri nets with at most one unbounded place). As for simulation-checking, we show the following: a) simulatio...
متن کاملA Upper bounds for Newton’s method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes, stochastic context-free grammars, probabilistic pushdown automata and recursive Markov chains) is the computation of termination probabilities, and computing these probabilities in turn boils do...
متن کامل